Size Optimization of Sextic Polynomials in the Number Field Sieve
نویسنده
چکیده
The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the chosen polynomials in polynomial selection can be modelled in terms of size and root properties. In this paper, we describe some methods to optimize the size property of sextic polynomials.
منابع مشابه
Root optimization of polynomials in the number field sieve
The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the chosen polynomials in polynomial selection can be modelled in terms of size and root properties. In this paper, we describe some algorithms for selecting polynomials with very good root properties. 1...
متن کاملRotations and Translations of Number Field Sieve Polynomials
We present an algorithm that finds polynomials with many roots modulo many primes by rotating candidate Number Field Sieve polynomials using the Chinese Remainder Theorem. We also present an algorithm that finds a polynomial with small coefficients among all integral translations of X of a given polynomial in ZZ[X]. These algorithms can be used to produce promising candidate Number Field Sieve ...
متن کاملBetter polynomials for GNFS
The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the selected polynomials can be modelled in terms of size and root properties. We propose a new kind of polynomials for GNFS: with a new degree of freedom, we further improve the size property. We demons...
متن کاملOn Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve
The general number field sieve (GNFS) is asymptotically the fastest known factoring algorithm. One of the most important steps of GNFS is to select a good polynomial pair. A standard way of polynomial selection (being used in factoring RSA challenge numbers) is to select a nonlinear polynomial for algebraic sieving and a linear polynomial for rational sieving. There is another method called a n...
متن کاملA Geometric Framework for the Subfield Problem of Generic Polynomials via Tschirnhausen Transformation
Let k be an arbitrary field. We study a general method to solve the subfield problem of generic polynomials for the symmetric groups over k via Tschirnhausen transformation. Based on the general result in the former part, we give an explicit solution to the field isomorphism problem and the subfield problem of cubic generic polynomials for S3 and C3 over k. As an application of the cubic case, ...
متن کامل